RBT--a tool for building refined Buneman trees

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

RBT - a tool for building refined Buneman trees

SUMMARY We have developed a tool implementing an efficient algorithm for refined Buneman tree reconstruction. The algorithm--which has the same complexity as the neighbour-joining method and the (plain) Buneman tree construction--enables refined Buneman tree reconstruction on large taxa sets. AVAILABILITY The source code for RBT, written in Java, is available under the GNU Public License (GPL...

متن کامل

Refined Buneman Trees

The field of bioinformatics needs efficient methods for analysing data. New and improved technologies increase the efficiency of e.g. DNA sequencing, and the amount of data coming out of biological research laboratories grows at an increasing rate. It is therefore important to be able to handle these huge amounts of data with limited computational power. Evolutionary tree reconstruction is a fu...

متن کامل

Computing Refined Buneman Trees in Cubic Time

Reconstructing the evolutionary tree for a set of n species based on pairwise distances between the species is a fundamental problem in bioinformatics. Neighbor joining is a popular distance based tree reconstruction method. It always proposes fully resolved binary trees despite missing evidence in the underlying distance data. Distance based methods based on the theory of Buneman trees and ref...

متن کامل

A Polynomial Time Algorithm for Constructing the Refined Buneman tree

We present a polynomial time algorithm for computing the refined Buneman tree, thereby making it applicable for tree reconstruction on large data sets. The refined Buneman tree retains many of the desirable properties of its predecessor, the well known Buneman tree, but has the practical advantage that it is typically more refined.

متن کامل

TKQML: A Scripting Tool for Building Agents

Tcl/Tk is an attractive language for the design of intelligent agents because it allows the quick construction of prototypes and user interfaces; new scripts can easily be bound at runtime to respond to events; and execution state is encapsulated by the interpreter, which helps in agent migration. However, a system of intelligent agents must share a common language for communicating requests an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bioinformatics

سال: 2004

ISSN: 1367-4803,1460-2059

DOI: 10.1093/bioinformatics/bti195